Description: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes! Platform: |
Size: 1432 |
Author:gao |
Hits:
Description: 最大流量Prim 算法寻找最小生成树,用C语言实现,有完整的注释-maximum flow Prim finding minimum spanning tree algorithm, using C language, a complete Notes Platform: |
Size: 1439 |
Author:DoDoggy |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM / ICPC contest and the preparation of information, because the competit Platform: |
Size: 4275 |
Author:kelly |
Hits:
Description: 这是一个数据结构c语言的最小生成树的程序代码。用的是普里姆算法实现的-This is a data structure of the minimum spanning tree c language program code. Prim algorithm is used to achieve the Platform: |
Size: 1024 |
Author:杨晓华 |
Hits:
Description: 最小生成树C语言描述，采用了Prim算法，提高程序运行速度-C language to describe the minimum spanning tree, using Prim algorithm, improve the running speed Platform: |
Size: 1024 |
Author:李杰 |
Hits:
Description: 本程序用C语言实现了Prim算法求解最小生成树问题-The program uses C language to implement the Prim algorithm for minimum spanning tree problem Platform: |
Size: 151552 |
Author:mafan |
Hits:
Description: 1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）；
2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）；
3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法；
4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。
5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。
-1 The basic storage methods mastered graph: adjacency matrix and adjacency list (the adjacency matrix used in the program)
2 master basic operations related to graph algorithms and high-level language can be used to achieve (the program uses C language)
3 master depth-first search and breadth-first traversal traversal search algorithm
4 master plans of the two minimum spanning tree algorithm:. Prim algorithm and kruskal algorithm.
5 master shortest path of two algorithms:. DIJ algorithm and floyd algorithm. Platform: |
Size: 4096 |
Author:奋斗菠萝 |
Hits:
Description: C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure Platform: |
Size: 2048 |
Author:haan36u195 |
Hits:
Description: 在本文章里面，有各种举出算法的C语言实现
1、大数阶乘
2、大数乘法
3、任意进制转换
4、最大公约数
5、最小公倍数
6、快速傅里叶变换
7，字符串的替换，查找，截取
8、叉乘法求多边形的面积
9、快速，希尔，选择等各种排序
10、二叉树，链表，链栈
11、二分查找
12、求解线性方程组，也叫中国余数定理
13、求点到直线距离
14、Prim算法求最小生成器
15、判断点与直线的关系，俩条直线的关系
16、求排列组合数，俩矢量角度
......
等等基础算法的C语言代码实现-1, large factorial
2, a large number of multiplication
3, arbitrary binary conversion
4, the largest common divisor
5, the least common multiple
6, fast Fourier transform
7, string replacement, search, interception
8, fork multiplication method for polygon area
9, fast, Hill, choice and other sort
10, binary tree, linked list, chain stack
11, binary search
12, solving linear equations, also known as the Chinese remainder theorem
13, seeking point to a straight line distance
14, Prim algorithm for the minimum generator
15, determine the point and the relationship between the two lines of the relationship
16, the number of permutations and combinations, two vector angle
...
And so on the basis of the C language code algorithm Platform: |
Size: 1247232 |
Author:刘楠 |
Hits:
Description: 现有一个景区，景区里面有若干个景点。现欲开发景区信息管理系统，对景点的信息进行管理。使用图的数据结构来保存景区景点信息，为用户提供创建图、查询景点信息、旅游景点导航、搜索最短路径、铺设电路规划等功能。
使用C++语言，通过对景区信息管理系统的四次迭代开发，实现以下主要学习目标：
1)掌握图的定义和图的存储结构，图的创建方法及其应用
2)掌握图的两种遍历方法及其应用
3)掌握迪杰特斯拉（Dijkstra）算法及其应用
4)理解最小生成树的概念、掌握普里姆（Prim）算法及应用(There is a scenic spot and there are several scenic spots in it. Now we want to develop the information management system of scenic spots and manage the information of scenic spots. The data structure of the map is used to preserve the scenic spots information, providing the users with the functions of creating maps, inquiring the information of the scenic spots, the navigation of the tourist attractions, the shortest path searching, the layout of the layout of the circuit and so on.
Using C++ language, the following four main learning objectives are achieved through the development of the scenic area information management system.
1) master the definition and storage structure of graph, create method and application of graph.
2) the two traversing methods of mastering the graph and its application
3) Master Diedje Tesla (Dijkstra) algorithm and its application.
4) understand the concept of minimum spanning tree, master Prim algorithm and application.) Platform: |
Size: 5120000 |
Author:haimaianbaobao |
Hits:
Search - prim algorithm c language